A Roller - Fast Sampling-Based Texture Synthesis Algorithm
نویسندگان
چکیده
This paper describes a method for synthesizing natural textures that realistically matches given colour texture appearance. The novel texture synthesis method, which we call the roller, is based on the overlapping tiling and subsequent minimum error boundary cut. An optimal double toroidal patch is seamlessly repeated during the synthesis step. While the method allows only moderate texture compression it is extremely fast due to separation of the analytical step of the algorithm from the texture synthesis part, universal, and easily implementable in a graphical hardware for purpose of real-time colour texture rendering.
منابع مشابه
Asymptotically Admissible Texture Synthesis
Recently there is a resurgent interest in example based texture analysis and synthesis in both computer vision and computer graphics. While study in computer vision is concerned with learning accurate texture models, research in graphics is aimed at effective algorithms for texture synthesis without necessarily obtaining explicit texture model. This paper makes three contributions to this recen...
متن کاملMultiresolution Block Sampling-Based Method for Texture Synthesis
We present an eficient multiresolution block samplingbased texture synthesis algorithm that works well for a wide vatiety of challenging textures. We consider the texture synthesis as a procedure that first estimates and then resumples a probability function. To achieve the eflect of good and fast estimation of the probubility function for a given texture us well us to retain the structural inf...
متن کاملNear-Regular Texture Synthesis
This paper describes a method for seamless enlargement or editing of difficult colour textures containing simultaneously both regular periodic and stochastic components. Such textures cannot be successfully modelled using neither simple tiling nor using purely stochastic models. However these textures are often required for realistic appearance visualisation of many man-made environments and fo...
متن کاملNovel Path Search Algorithm for Image Stitching and Advanced Texture Tiling
We propose a fast and adjustable sub-optimal path search algorithm for finding minimum error boundaries between overlapping images. The algorithm may serve as an efficient alternative to traditional slow path search algorithms like the dynamical programming. We use the algorithm in combination with novel adaptive blending to stitch image regions. The technique is then exploited in a framework f...
متن کاملFast Estimation of Nonparametric Kernel Density Through PDDP, and its Application in Texture Synthesis
In thiswork, anewalgorithm isproposed for fast estimationofnonparametricmultivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data space.The goal of the proposed algorithm is to use the finite support property of kernels for fast estimation of density. Compared to earlier approaches, this work explains the need of using boundaries (for partitioning the sp...
متن کامل